Approximate Comparison of Functions Computed by Distance Automata
نویسندگان
چکیده
منابع مشابه
Approximate comparison of distance automata
Distance automata are automata weighted over the semiring (N ∪ {∞},min,+) (the tropical semiring). Such automata compute functions from words to N ∪ {∞} such as the number of occurrences of a given letter. It is known that testing f 6 g is an undecidable problem for f, g computed by distance automata. The main contribution of this paper is to show that an approximation of this problem becomes d...
متن کاملReal Functions computed by Parametric Weighted Finite Automata
Weighted finite automata (WFA) are an extension of finite automata that can be used to compute real functions and parametric WFA (PWFA) are a multidimensional variant of WFA. This paper shows that each PWFA computable set is computable by a PWFA that has an alphabet cardinality of two. Further we show that real polynomials with solely rational coefficients can be computed by PWFA that do not us...
متن کاملApproximate String Matching by Finite Automata
Abs t r ac t . Approximate string matching is a sequential problem and therefore it is possible to solve it using finite automata. A nondeterministic finite automaton is constructed for string matching with k mismatches. It is shown, how "dynamic programming" and "shift-and" based algorithms simulate this nondeterministic finite automaton. The corresponding deterministic finite automaton have O...
متن کاملApproximate String Matching by Fuzzy Automata
We explain new ways of constructing search algorithms using fuzzy sets and fuzzy automata. This technique can be used to search or match strings in special cases when some pairs of symbols are more similar to each other than the others. This kind of similarity can’t be handled by usual searching algorithms. We present sample situations, which would use this kind of searching. Then we define a f...
متن کاملApproximate Identification of Automata
Brian R. Gaines Department of Electrical Engineering Science University of Essex Colchester, Essex, England A technique is described for the identification of probabilistic and other non-deterministic automata from sequences of their input/output behaviour. For a given number of states the models obtained are optimal in well defined senses, one related to least-mean-square approximation and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2015
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-015-9643-3